Angle-Restricted Tours in the plane
نویسندگان
چکیده
منابع مشابه
Angle-Restricted Tours in the Plane
For a given set A C_ (-Tr; +Tr] of angles, the problem "Angle-Restricted Tour" (ART) is to decide whether a set P of n points in the Euclidean plane allows a closed directed tour consisting of straight line segments, such that all angles between consecutive line segments are from the set A. We present a variety of algorithmic and combinatorial results on this problem. In particular, we show tha...
متن کاملPlanning time restricted logistic tours with fuzzy logic
We present a modification of the vehicle routing problem with the additional restriction that time windows are associated with each customer by defining an interval wherein the customer has to be supplied. We introduce a two phase strategy of this vehicle routing and scheduling problem with time windows using fuzzy logic to realize inference steps in fuzzy if-then rule bases.
متن کاملThe Effects of Different Walking Inclinations on Knee Angle in the Frontal Plane of Patients with Varus Malalignment
Purpose: Given the high prevalence of varus malalignment of the knee and the consequences of walking on different surfaces on this malalignment, the aim of the present study was to investigate the effect of walking inclination on knee angle in the frontal plane of patients with varus malalignment. Methods: 18 male subjects with varus malalignment classified at grade 3 bowleg, within the a...
متن کاملCo-relation between Anb Angle, Wits Value & Snp Plane Angle
ANB angle & Wits value are used to asses the Sagital pattern of the patient cephalometrically. The two variables are dependent on change in the Antero-posterior & vertical position of Point A. SNP plane angle determines the rotation change in position of Palatal plane with reference to SN plane. This rotational change might have an impact on the position of point A and thus the ANB angle and wi...
متن کاملNot All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane
An insertion heuristic for the traveling salesman problem adds cities iteratively to an existing tour by replacing one edge with a two-edge path through the new city in the cheapest possible way. Rosenkrantz, Stearns, and Lewis asked whether every order of inserting vertices gives a constant-factor approximation algorithm. We answer this question by showing that for some point sets, there is an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1997
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(96)00012-0